Finding a maximum induced matching in weakly chordal graphs
نویسندگان
چکیده
منابع مشابه
Maximum Vertex-weighted Matching in Strongly Chordal Graphs
Given a graph G = (V; E) and a real weight for each vertex of G, the vertex-weight of a matching is deened to be the sum of the weights of the vertices covered by the matching. In this paper we present a linear time algorithm for nding a maximum vertex-weighted matching in a strongly chordal graph, given a strong elimination ordering. The algorithm can be specialized to nd a maximum cardinality...
متن کاملWhat Is between Chordal and Weakly Chordal Graphs?
An (h, s, t)-representation of a graph G consists of a collection of subtrees {Sv |v ∈ V (G)} of a tree T , such that (i) the maximum degree of T is at most h, (ii) every subtree has maximum degree at most s, and (iii) there is an edge between two vertices in the graph if and only if the corresponding subtrees in T have at least t vertices in common. For example, chordal graphs correspond to [∞...
متن کاملIntersection models of weakly chordal graphs
We first present new structural properties of a two-pair in various graphs. A twopair is used in a well-known characterization of weakly chordal graphs. Based on these properties, we prove the main theorem: a graph G is a weakly chordal (K2,3, 4P2, P2 ∪ P4, P6,H1,H2,H3)-free graph if and only if G is an edge intersection graph of subtrees on a tree with maximum degree 4. This characterizes the ...
متن کاملAcyclic Colorings and Triangulations of Weakly Chordal Graphs
An acyclic coloring of a graph is a proper vertex coloring without bichromatic cycles. We show that the acyclic colorings of any weakly chordal graph G correspond to the proper colorings of triangulations of G. As a consequence, we obtain polynomial-time algorithms for the acyclic coloring problem and the perfect phylogeny problem on the class of weakly chordal graphs. Our results also imply li...
متن کاملA simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs
In this paper, we consider the problem of finding a maximum weight 2-matching containing no cycle of length at most three in a weighted simple graph, which we call the weighted trianglefree 2-matching problem. Although the polynomial solvability of this problem is still open in general graphs, a polynomial-time algorithm is given by Hartvigsen and Li for the problem in subcubic graphs, i.e., gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2003
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00803-8